Lasso Regularized Gabor Shearlet Face Multivariate Sparse Function Approximation
نویسندگان
چکیده
منابع مشابه
Face authentication with sparse grid Gabor information
This paper investigates the application of statistical pattern recognition methods in the framework of the Dynamic Link Matching approach. This method describes objects by means of local frequency information on nodes of a sparse grid. Matching of an input image with a reference is achieved by displacement and deformation of the grid. This method is applied here to the authentication of human f...
متن کاملBlock Regularized Lasso for Multivariate Multi-Response Linear Regression
The multivariate multi-response (MVMR) linear regression problem is investigated, in which design matrices are Gaussian with covariance matrices Σ = ( Σ, . . . ,Σ ) for K linear regressions. The support union of K p-dimensional regression vectors (collected as columns of matrix B∗) are recovered using l1/l2-regularized Lasso. Sufficient and necessary conditions to guarantee successful recovery ...
متن کاملFace Classification via Sparse Approximation
We address the problem of 2D face classification under adverse conditions. Faces are difficult to recognize since they are highly variable due to such factors as illumination, expression, pose, occlusion and resolution. We investigate the potential of a method where the face recognition problem is cast as a sparse approximation. The sparse approximation provides a significant amount of robustne...
متن کاملGeneralized Lasso based Approximation of Sparse Coding for Visual Recognition
Sparse coding, a method of explaining sensory data with as few dictionary bases as possible, has attracted much attention in computer vision. For visual object category recognition, `1 regularized sparse coding is combined with the spatial pyramid representation to obtain state-of-the-art performance. However, because of its iterative optimization, applying sparse coding onto every local featur...
متن کاملSurveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approximation, with common sparsity profile induced by a `p− `q mixed-norm. Such a problem is also known in the statistical learning community as the group lasso problem. We have gathered and detailed different algorithmic resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Hybrid Information Technology
سال: 2016
ISSN: 1738-9968,1738-9968
DOI: 10.14257/ijhit.2016.9.8.12